On-line Construction of a Small Automaton for a Finite Set of Words
نویسندگان
چکیده
In this paper we describe a “light” algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
منابع مشابه
BCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملUNIFORM AND SEMI-UNIFORM TOPOLOGY ON GENERAL FUZZY AUTOMATA
In this paper, we dene the concepts of compatibility between twofuzzy subsets on Q, the set of states of a max- min general fuzzy automatonand transitivity in a max-min general fuzzy automaton. We then construct auniform structure on Q, and dene a topology on it. We also dene the conceptof semi-uniform structures on a nonempty set X and construct a semi-uniformstructure on the set of states of ...
متن کاملGenerating the Functions with Regular Graphs under Composition
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article I study the regular functions, such relations which are also functions in the set-theoretic sense. Here I present a small (but necessarily infinite) collection of (multi-ary) functions which generate the regular functions under composition. To t...
متن کاملA Novel Qualitative State Observer
The state estimation of a quantized system (Q.S.) is a challenging problem for designing feedback control and model-based fault diagnosis algorithms. The core of a Q.S. is a continuous variable system whose inputs and outputs are represented by their corresponding quantized values. This paper concerns with state estimation of a Q.S. by a qualitative observer. The presented observer in this pape...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کامل